Expected Crossing Numbers
نویسندگان
چکیده
The expected value for the weighted crossing number of a randomly weighted graph is studied. A variation of the Crossing Lemma for expectations is proved. We focus on the case where the edge-weights are independent random variables that are uniformly distributed on [0, 1].
منابع مشابه
On the Decay of Crossing Numbers
Richter and Thomassen proved that every graph has an edge e such that the crossing number crpG eq of G e is at least p2{5qcrpGq Op1q. Fox and Cs. Tóth proved that dense graphs have large sets of edges (proportional in the total number of edges) whose removal leaves a graph with crossing number proportional to the crossing number of the original graph; this result was later strenghtened by Černý...
متن کاملAttitudes of Iranians toward the Becker Proposition
This paper evaluates attitudes of Iranians toward crossing red traffic lights and their sensitivity to fines. Economic theory of crime under expected utility predicts that because of the possibility of severe punishments, risk adverse individuals would not cross red lights. This is implied by the Becker proposition. However, among 262 individuals surveyed, more than half of the sample has previ...
متن کاملPercolation crossing formulae and conformal field theory
Using conformal field theory, we derive several new crossing formulae at the two-dimensional percolation point. High-precision simulation confirms these results. Integrating them gives a unified derivation of Cardy’s formula for the horizontal crossing probability h(r), Watts’ formula for the horizontal– vertical crossing probability hv(r) and Cardy’s formula for the expected number of clusters...
متن کاملOn the crossing numbers of Cartesian products with trees
Zip product was recently used in a note establishing the crossing number of the Cartesian product K1,n2Pm. In this paper, we further investigate the relations of this graph operation with the crossing numbers of graphs. First, we use a refining of the embedding method bound for crossing numbers to weaken the connectivity condition under which the crossing number is additive for the zip product....
متن کاملThe crossing numbers of products of path with graphs of order six
The crossing numbers of Cartesian products of paths, cycles or stars with all graphs of order at most four are known. For the path Pn of length n, the crossing numbers of Cartesian products G Pn for all connected graphs G on five vertices are also known. In this paper, the crossing numbers of Cartesian products G Pn for graphs G of order six are studied. Let H denote the unique tree of order si...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید
ثبت ناماگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید
ورودعنوان ژورنال:
- Electronic Notes in Discrete Mathematics
دوره 38 شماره
صفحات -
تاریخ انتشار 2011